Successive failures of approachability

نویسندگان

چکیده

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than $${\aleph _1}$$ , produce model which the approachability property fails (hence there are no trees) at all regular cardinals interval $$\left[ {{\aleph _2},{\aleph _{{\omega ^2} + 3}}} \right]$$ and $${{\aleph ^2}}}}$$ is strong limit.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Successive Failures of Approachability

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than א1, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all regular cardinals in the interval [א2,אω2+3] and אω2 is strong limit.

متن کامل

Successive survivable routing for node failures

This paper addresses the spare capacity allocation (SCA) problem considering any single node failure in mesh networks. The SCA node failure problem aims at finding backup routes and providing sufficient spare capacity to protect traffic when any single node fails in communication network. Here, we introduce our novel matrix formulation of the arc-flow SCA node failure model. In this model, work...

متن کامل

Lecture : Blackwell's Approachability Theorem . Blackwell's Approachability Theorem

Counter-example to (.): If S = {(p,q) : p = q} and r(p,q) = (p,q), one can trivially, for all q, choose p(q) = q to guarantee that r(p(q),q) ∈ S. It is however not possible to find a p which works for all q, indeed the only p which works for a given q is p = q. However, the duality statement (.) holds when S is a half-space {x | v ·x ≥ c}. To see this, define a zero-sum game with scalar p...

متن کامل

Approachability with bounded memory

Article history: Received 8 March 2006 Available online 17 October 2008 JEL classification: C61 C72 C73

متن کامل

Internal Approachability and Reflection

We prove that the Weak Reflection Principle does not imply that every stationary set reflects to an internally approachable set. We show that several variants of internal approachability, namely internally unbounded, internally stationary, and internally club, are not provably equivalent. Let λ ≥ ω2 be a regular cardinal, and consider an elementary substructure N ≺ H(λ) with size א1. Then N is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2138-9